Self-regenerative Markov chain Monte Carlo with adaptation
نویسندگان
چکیده
منابع مشابه
Self Regenerative Markov Chain Monte Carlo with Adaptation
This article proposes a new method of construction of Markov chains with a given stationary distribution. The method is based on constructing an auxiliary chain with some other stationary distribution and picking elements of this auxiliary chain a suitable number of times. The proposed method is easy to implement and analyze; it could be more efficient than some related MCMC techniques. The mai...
متن کاملSelf Regenerative Markov Chain Monte Carlo
We propose a new method of construction of Markov chains with a given stationary distribution. This method is based on construction of an auxiliary chain with some other stationary distribution and picking elements of this auxiliary chain a suitable number of times. The proposed method has many advantages over its rivals. It is easy to implement; it provides a simple analysis; it can be faster ...
متن کاملMarkov Chain Monte Carlo
Markov chain Monte Carlo is an umbrella term for algorithms that use Markov chains to sample from a given probability distribution. This paper is a brief examination of Markov chain Monte Carlo and its usage. We begin by discussing Markov chains and the ergodicity, convergence, and reversibility thereof before proceeding to a short overview of Markov chain Monte Carlo and the use of mixing time...
متن کاملMarkov Chain Monte Carlo
This paper gives a brief introduction to Markov Chain Monte Carlo methods, which offer a general framework for calculating difficult integrals. We start with the basic theory of Markov chains and build up to a theorem that characterizes convergent chains. We then discuss the MetropolisHastings algorithm.
متن کاملMarkov chain Monte Carlo
One of the simplest and most powerful practical uses of the ergodic theory of Markov chains is in Markov chain Monte Carlo (MCMC). Suppose we wish to simulate from a probability density π (which will be called the target density) but that direct simulation is either impossible or practically infeasible (possibly due to the high dimensionality of π). This generic problem occurs in diverse scient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bernoulli
سال: 2003
ISSN: 1350-7265
DOI: 10.3150/bj/1065444811